A general division algorithm for residue number systems

We present in this paper a novel general algorithm for signed number division in Residue Number Systems (RNS). A parity checking technique is used to accomplish the sign and overflow detection in this algorithm. Compared with conventional methods of sign and overflow detection, the parity checking method is more e f ficient and practical. Sign magnitude arithmetic division is implemented using binary search. There is no restriction to the dividend and the divisor (except zero divisor), and no quotient estimation is necessary before the division is started. In hardware implementations, the storage of one table is required for parity checking, and all the other arithmetic operations are completed b y calculations. Only simple operations are needed to accomplish this R N S division. All these characteristics have made our algorithm simple, e f i cient, and practical to be implemented on a real R N S divader.